全文获取类型
收费全文 | 25087篇 |
免费 | 2028篇 |
国内免费 | 1286篇 |
专业分类
电工技术 | 318篇 |
技术理论 | 1篇 |
综合类 | 2087篇 |
化学工业 | 1552篇 |
金属工艺 | 445篇 |
机械仪表 | 508篇 |
建筑科学 | 408篇 |
矿业工程 | 84篇 |
能源动力 | 1797篇 |
轻工业 | 304篇 |
水利工程 | 177篇 |
石油天然气 | 124篇 |
武器工业 | 32篇 |
无线电 | 2227篇 |
一般工业技术 | 3229篇 |
冶金工业 | 190篇 |
原子能技术 | 165篇 |
自动化技术 | 14753篇 |
出版年
2024年 | 38篇 |
2023年 | 631篇 |
2022年 | 665篇 |
2021年 | 835篇 |
2020年 | 973篇 |
2019年 | 858篇 |
2018年 | 1100篇 |
2017年 | 1680篇 |
2016年 | 1760篇 |
2015年 | 1684篇 |
2014年 | 2172篇 |
2013年 | 2021篇 |
2012年 | 1947篇 |
2011年 | 2025篇 |
2010年 | 1511篇 |
2009年 | 1700篇 |
2008年 | 995篇 |
2007年 | 1180篇 |
2006年 | 984篇 |
2005年 | 672篇 |
2004年 | 354篇 |
2003年 | 402篇 |
2002年 | 414篇 |
2001年 | 405篇 |
2000年 | 276篇 |
1999年 | 298篇 |
1998年 | 153篇 |
1997年 | 108篇 |
1996年 | 117篇 |
1995年 | 37篇 |
1994年 | 26篇 |
1993年 | 21篇 |
1992年 | 21篇 |
1991年 | 16篇 |
1990年 | 23篇 |
1989年 | 14篇 |
1988年 | 12篇 |
1987年 | 17篇 |
1986年 | 12篇 |
1985年 | 26篇 |
1984年 | 31篇 |
1983年 | 31篇 |
1982年 | 26篇 |
1981年 | 30篇 |
1980年 | 14篇 |
1979年 | 14篇 |
1978年 | 16篇 |
1974年 | 10篇 |
1973年 | 10篇 |
1971年 | 7篇 |
排序方式: 共有10000条查询结果,搜索用时 319 毫秒
991.
We present an efficient implementation of the Modified SParse Approximate Inverse (MSPAI) preconditioner. MSPAI generalizes the class of preconditioners based on Frobenius norm minimizations, the class of modified preconditioners such as MILU, as well as interface probing techniques in domain decomposition: it adds probing constraints to the basic SPAI formulation, and one can thus optimize the preconditioner relative to certain subspaces. We demonstrate MSPAI’s qualities for iterative regularization problems arising from image deblurring.Such applications demand for a fast and parallel preconditioner realization. We present such an implementation introducing two new optimization techniques: First, we avoid redundant calculations using a dictionary. Second, our implementation reduces the runtime spent on the most demanding numerical parts as the code switches to sparse QR decomposition methods wherever profitable. The optimized code runs in parallel with a dynamic load balancing. 相似文献
992.
Feature-Oriented Software Development provides a multitude of formalisms, methods, languages, and tools for building variable, customizable, and extensible software. Along different lines of research, different notions of a feature have been developed. Although these notions have similar goals, no common basis for evaluation, comparison, and integration exists. We present a feature algebra that captures the key ideas of feature orientation and that provides a common ground for current and future research in this field, on which also alternative options can be explored. Furthermore, our algebraic framework is meant to serve as a basis for the development of the technology of automatic feature-based program synthesis and architectural metaprogramming. 相似文献
993.
994.
线性拉普拉斯判别准则(Linear Laplacian discrimination, LLD)作为一种非线性特征提取方法得到了较为成功的运用. 然而通过分析得知在具体使用LLD方法的过程中还会面临小样本以及如何确定原始样本空间类型的问题. 因此, 本文引入语境距离度量并结合最大间距判别准则的基本原理提出一种基于语境距离度量的拉普拉斯最大间距判别准则(Contextual-distance metric based Laplacian maximum margin criterion, CLMMC). 该准则不但在一定程度上避免小样本问题, 而且由于语境距离度量更关注输入样本簇内在的本质结构而不是原始样本空间的类型, 从而降低了该准则对特定样本空间的依赖程度. 同时通过引入计算语境距离度量的新算法并结合QR分解的基本原理, 使得CLMMC在处理高维矢量模式数据时更具适应性和效率. 并从理论上讨论CLMMC准则具有的基本性质以及与LLD准则的内在联系. 实验证明CLMMC准则具有上述优势. 相似文献
995.
Dimensionality reduction is often required as a preliminary stage in many data analysis applications. In this paper, we propose a novel supervised dimensionality reduction method, called linear discriminant projection embedding (LDPE), for pattern recognition. LDPE first chooses a set of overlapping patches which cover all data points using a minimum set cover algorithm with geodesic distance constraint. Then, principal component analysis (PCA) is applied on each patch to obtain the data's local representations. Finally, patches alignment technique combined with modified maximum margin criterion (MMC) is used to yield the discriminant global embedding. LDPE takes both label information and structure of manifold into account, thus it can maximize the dissimilarities between different classes and preserve data's intrinsic structures simultaneously. The efficiency of the proposed algorithm is demonstrated by extensive experiments using three standard face databases (ORL, YALE and CMU PIE). Experimental results show that LDPE outperforms other classical and state of art algorithms. 相似文献
996.
997.
998.
The location of manufacturing facilities is one of the most important strategic decisions considered in the design of logistic systems. Another important strategic decision is the structure and management of the fleets. Most often, even if two types of problem (i.e., location of facilities and vehicle routing) have occurred in a given scenario, they have been studied and solved separately. This paper presents a new integrated mathematical model for a bi-objective multi-depot location-routing problem where the total demand served is to be maximized and the total cost, consisting of start-up of the facility, fixed and variable depots and variable delivery cost, is to be minimized. Since this type of the problem is NP-hard, a new multi-objective scatter search (MOSS) algorithm is proposed to obtain the Pareto frontier for the given problem. To validate the performance of the proposed MOSS algorithm in terms of the solution quality and diversity level, various test problems are carried out and the efficiency of this algorithm based on some comparison metrics is compared with the elite tabu search (ETS). The computational results show that the proposed MOSS outperforms the ETS, especially in large-sized problems. 相似文献
999.
According to actual needs, a generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than the existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Compared with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes. 相似文献
1000.